Alex Andoni: Approximating Edit Distance In Near-Linear Time

Alex Andoni: Approximating Edit Distance in Near-Linear Time

Alexandr Andoni (Columbia): Approximating Edit Distance in Near-Linear Time

Alexandr Andoni on Virtual Foundations of Data Science Series (Oct 09, 2020)

Edit Distance in Near-Linear Time: it’s a Constant Factor

IEEE FOCS: Foundations of Computer Science

Session 6A - Constant factor approximations to edit distance on in nearly linear time

Association for Computing Machinery (ACM)

Approximating the edit distance to within a constant factor in truly subquadratic time - Mike Saks

Institute for Advanced Study

Approximating Edit Distance in the Fully Dynamic Model

Simons Institute

3.5: Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time

FOCS Conference

TCS+ talk: Alexandr Andoni

TCS+

A Near-Linear Time Algorithm for the Chamfer Distance

Simons Institute

Nick Fischer - Faster Sublinear-Time Edit Distance

A3B.5 An Almost Optimal Edit Distance Oracle

STOC 2022 - Almost Optimal Sublinear Time Edit Distance in the Low Distance Regime

Sketching and embedding are equivalent for norms - Alex Andoni

Institute for Advanced Study

Dimensionality reductions (by Alexander Andoni)

Datalogisk Institut - Københavns Universitet

Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack

MIT OpenCourseWare

Sublinear Time Algorithm for Edit Distance

Simons Institute

TCS+ talk: Michal Koucky

TCS+

Alexandr Andoni - The Geometry of Similarity Search (May 19, 2017)

Simons Foundation